package leetcode_ago.LinearList;

public class Num21_MergeTwoListOfRecursion {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        if(list1==null){
            return list2;
        }
        if(list2==null){
            return list1;
        }
        //方法是合并两个链表，即拼接两个链表
        if(list1.val<list2.val){
            //1对应的值小，拼接链表操作接在list1后面
            list1.next=mergeTwoLists(list1.next,list2);
            return list1;
        }else{
            list2.next=mergeTwoLists(list1,list2.next);
            return list2;
        }
    }
}
